Efficient Statistical Modeling for the Compression of Tree Structured Intermediate Code
نویسندگان
چکیده
We propose a scheme for the compression of tree structured intermediate code consisting of a sequence of trees specified by a regular tree grammar. The scheme is based on arithmetic coding, and the model that works in conjunction with the coder is automatically generated from the syntactical specification of the tree language. Experiments on data sets consisting of intermediate code trees yield compression ratios ranging from 2.5 to 8, for file sizes ranging from 167 bytes to 1 megabyte.
منابع مشابه
The Minimum Description Length Principle in Coding and Modeling
We review the principles of Minimum Description Length and Stochastic Complexity as used in data compression and statistical modeling. Stochastic complexity is formulated as the solution to optimum universal coding problems extending Shannon’s basic source coding theorem. The normalized maximized likelihood, mixture, and predictive codings are each shown to achieve the stochastic complexity to ...
متن کاملModeling Children Ever Born and Ideal Number of Children by Classification Tree
Background: Fertility is one of the important subjects in public health and demographic studies which affects population growth. The main objective of this paper was to introduce and apply a tree model to classify the ideal number of children and children ever born in the study of "Marriage and Fertility Attitudes of Married 15-49 Years Old Women in Semnan Province in Iran, 2012". Methods: Cla...
متن کاملAn efficient algorithm for finding the semi-obnoxious $(k,l)$-core of a tree
In this paper we study finding the $(k,l)$-core problem on a tree which the vertices have positive or negative weights. Let $T=(V,E)$ be a tree. The $(k,l)$-core of $T$ is a subtree with at most $k$ leaves and with a diameter of at most $l$ which the sum of the weighted distances from all vertices to this subtree is minimized. We show that, when the sum of the weights of vertices is negative, t...
متن کاملVideo modeling using 3-D hidden markov model
Statistical modeling methods have become critical for many image processing problems, such as segmentation, compression and classification. In this paper we are proposing and experimenting a computationally efficient simplification of 3-Dimensional Hidden Markov Models. Our proposed model relaxes the dependencies between neighboring state nodes to a random uni-directional dependency by introduc...
متن کاملAn Efficient Low-Bit Rate Motion Compensation Technique Based on Quadtree
ABSTRACT Quad-tree structured motion-compensation technique effectively utilizes the motion content of a frame as oppose to fixed size block motion compensation technique. In this paper, we propose a novel quad-tree-structured region-wise motion compensation technique that divides a frame into equilateral triangle blocks using the quad-tree structure. Arbitrary partition shapes are achieved by ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Comput. J.
دوره 46 شماره
صفحات -
تاریخ انتشار 2003